package LeetCode;

import java.util.Arrays;
import java.util.HashMap;

public class LC_001_TwoSum {
    public static void main(String[] args) {
        int[] a = {1, 2, 3, 4, 5, 7};
        int t = 10;
        System.out.println(Arrays.toString(twoSum(a, t)));
    }

    private static int[] twoSum(int[] nums, int target) {
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target - nums[i]))
                return new int[]{map.get(target - nums[i]), i};
            map.put(nums[i], i);
        }
        throw new IllegalArgumentException("No two sum solution");
    }

}
